منابع مشابه
Sequential scheduling on identical machines
We study a sequential version of the well-known KP-model: Each of n agents has a job that needs to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the finish time of his machine. We study the corresponding sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insig...
متن کاملHeuristics for Scheduling on Restricted Identical Machines
In this paper we propose a simple efficient algorithm for the problem of job scheduling on restricted identical machines, with the objective of minimizing makespan. This problem is a special case of R ||Cmax, where a job can only be assigned to a subset of machines. The algorithm runs in O(n logn + S) where n is the number of jobs and S the sum of valid machines of every job. Experimental resul...
متن کاملScheduling identical parallel machines with tooling constraints
We model and solve the problem of sequencing a set of jobs with specified processing times and tool requirements on a set of identical parallel machines. Decisions concern the assignment of jobs to machines, their sequencing, and the allocation of tools on each machine. The objective function minimizes the makespan. We propose an adaptive large neighborhood search metaheuristic in which the des...
متن کاملApproximating Real-Time Scheduling on Identical Machines
We study the problem of assigning n tasks to m identical parallel machines in the real-time scheduling setting, where each task recurrently releases jobs that must be completed by their deadlines. The goal is to find a partition of the task set over the machines such that each job that is released by a task can meet its deadline. Since this problem is co-NP-hard, the focus is on finding α-appro...
متن کاملMinimizing Makespan on Identical Parallel Machines
A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan. Computational results indicate that the proposed algorithm is very competitive with respect to well-known constructive algorithms for a larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychiatric Bulletin
سال: 1995
ISSN: 0955-6036,1472-1473
DOI: 10.1192/pb.19.6.377-a